Two-variable Logic with a Between Predicate
نویسندگان
چکیده
We study an extension of FO2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, ‘the letter a appears between positions x and y’. This is, in a sense, the simplest property that is not expressible using only two variables. We present several logics, both first-order and temporal, that have the same expressive power, and find matching lower and upper bounds for the complexity of satisfiability for each of these formulations. We also give an effective necessary condition, in terms of the syntactic monoid of a regular language, for a property to be expressible in this logic. We show that this condition is also sufficient for words over a two-letter alphabet. This algebraic analysis allows us us to prove, among other things, that our new logic has strictly less expressive power than full first-order logic FO[<].
منابع مشابه
Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
Following recent works connecting two-variable logic to circuits and monoids, we establish, for numerical predicate sets P satisfying a certain closure property, a one-to-one correspondence between FO[<, P]-uniform linear circuits, two-variable formulas with P predicates, and weak block products of monoids. In particular, we consider the case of linear TC, majority quantifiers, and finitely typ...
متن کاملDecidability of Predicate Logics with Team Semantics
We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIMEcomplete. Furthermore, we show that the validity problem of two-variable dependence logic is undecidable, thereby solving an open problem from the team semantics literature. We also briefly analyse the complexity of...
متن کاملThe two-variable fragment with counting and equivalence
We consider the two-variable fragment of first-order logic with counting, subject to the stipulation that a single distinguished binary predicate be interpreted as an equivalence. We show that the satisfiability and finite satisfiability problems for this logic are both NEXPTIME-complete. We further show that the corresponding problems for two-variable first-order logic with counting and two eq...
متن کاملFinite-Degree Predicates and Two-Variable First-Order Logic
We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the order predicate only. From this result we derive the separation of the alternation hierarchy of two-variable logic on this signature.
متن کاملThe StateClock tool and clockcharts
The purpose of this paper is to give a theoretical description of clockcharts, and their implementation in the StateClock tool for COSC4352 students. 1.0 Temporal logic and fair transition systems In the sequel, we use relative quantification where Q is a quantifier (e.g. ∀ or ∃), T is the type of the dummy variable x, R is the range of the dummy variable and P a predicate [Gries, 1993 #369]. F...
متن کاملA semantic study of the first-order predicate logic with uncertainty involved
In this paper, we provide a semantic study of the first-order predicate logic for situations involving uncertainty. We introduce the concepts of uncertain predicate proposition, uncertain predicate formula, uncertain interpretation and degree of truth in the framework of uncertainty theory. Compared with classical predicate formula taking true value in {0, 1}, the degree of truth of uncertain p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1603.05625 شماره
صفحات -
تاریخ انتشار 2016